Construction for obtaining trellis run length limited error control codes from convolutional codes
نویسندگان
چکیده
Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which is already contained in the original convolutional error control code. One example is presented how to get such a code from a convolutional low density parity check code.
منابع مشابه
Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n − 1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the p...
متن کاملError Propagation Assessment of Enumerative Coding Schemes Kees
2591 consisting of two four-state trellises. To this point, though, no new codes comparable to, for example, the rate 4=5 and the rate 8=9 MTR codes in [10] for the (1 0 D) (1 + D) 3 and (1 0 D) (1 + D) 4 channels have been found. For future work, an interesting research problem would be to relax the trellis-matching constraint to enlarge the constellations, thus obtaining higher-rate codes. Of...
متن کاملError-Trellis Construction for Tailbiting Convolutional Codes
Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction ...
متن کاملLecture Notes 8: Trellis Codes
In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with signals from a small set. Because the trellis is of infinite length this is conceptually different than the signals created in the previous chapter. We the codes generated are linear (the sum of any two sequences is also a valid sequence) then t...
متن کاملNew multilevel codes over GF(q)
In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...
متن کامل